Fundamental Structures in Well-Structured Infinite Transition Systems
نویسندگان
چکیده
We suggest a simple and clean deenition for Well-Structured Transition Systems Fin90,A CJY96], a general class of innnite state systems for which decidability results exist. As a consequence we can (1) generalize the deenition in many ways, (2) nd examples of (general) WSTS's in many elds, and (3) present new decidability results.
منابع مشابه
Unfolding Concurrent Well-Structured Transition Systems
Our main objective is to combine partial-order methods with verification techniques for infinite-state systems in order to obtain efficient verification algorithms for concurrent infinite-state systems. Partial-order methods are commonly used in the analysis of finite systems consisting of many parallel components. In this paper we propose an extension of these methods to parallel compositions ...
متن کاملAn algorithmic framework for checking coverability in well-structured transition systems
Well-structured transition systems are an abstract class of infinite-state systems with transitions that are compatible with a simulation relation. In the context of automatic verification of these models, it often suffices to consider certain coverability problems which can be decided by the basic backward analysis algorithm introduced by Abdulla et al. When instantiating this algorithm for co...
متن کاملModel Checking with Abstraction Refinement for Well-Structured Systems Master Thesis
Abstraction plays an important role in the verification of infinite-state systems. One of the most promising and popular abstraction techniques is predicate abstraction. The right abstraction, i.e. the one that is sufficiently precise to prove or disprove the property under consideration, is automatically constructed by iterative abstraction refinement. The abstract-check-refine loop is not gua...
متن کاملReduction and covering of infinite reachability trees
We present a structure for transition systems with which the main decidability results on Petri nets can be generalized to structured transition systems. We define the reduced reachability tree of a structured transition system; it allows one to decide the finite reachability tree problem (also called the finite termination problem) and the finite reachability set problem. A general definition ...
متن کاملStructured Production System (extended abstract)
In this extended abstract, we propose Structured Production Systems (SPS), which extend traditional production systems with well-formed syntactic structures. Due to the richness of structures, structured production systems significantly enhance the expressive power as well as the flexibility of production systems, for instance, to handle uncertainty. We show that different rule application stra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998